A General Approach for Identifying Special Casesof the Travelling Salesman Problemwith a Fixed Optimal Tour
نویسندگان
چکیده
منابع مشابه
A CONSTRAINED SOLID TSP IN FUZZY ENVIRONMENT: TWO HEURISTIC APPROACHES
A solid travelling salesman problem (STSP) is a travelling salesman problem (TSP) where the salesman visits all the cities only once in his tour using dierent conveyances to travel from one city to another. Costs and environmental eect factors for travelling between the cities using dierent conveyances are dierent. Goal of the problem is to nd a complete tour with minimum cost that damages the ...
متن کاملEuclidean Traveling Salesman Problem
Since the computation of an exact solution is very expensive (under the assumption that P 6= NP ), we are interested in approximate solutions – at least for special cases. Particularly, we look for an Polynomial Time Approximation Scheme (PTAS), i.e., for any fixed error parameter ε > 0, the running time is bounded by a polynomial in n and the costs of the computed tour does not exceed (1+ε) ·O...
متن کاملDeveloping a guaranteed-accuracy heuristic learning algorithm for travelling salesman problems
This research investigates the feasibility of applying a guaranteed-accuracy heuristic learning algorithm to address the traveling salesman problem. The research focuses on tour construction. The advantage of tour construction heuristic is its simplicity in concept. However, tour construction heuristic often results in a sub-optimal solution and the tour often needs to be improved after it is b...
متن کاملA New Hybrid Parallel Simulated Annealing Algorithm for Travelling Salesman Problem with Multiple Transporters
In today’s competitive transportation systems, passengers search to find traveling agencies that are able to serve them efficiently considering both traveling time and transportation costs. In this paper, we present a new model for the traveling salesman problem with multiple transporters (TSPMT). In the proposed model, which is more applicable than the traditional versions, each city has diffe...
متن کاملA new asymmetric pyramidally solvable class of the traveling salesman problem
We present a new method of identifying a class of asymmetric matrices for which an optimal traveling salesman tour exists that is pyramidal. The new class generalizes two previously known classes of matrices and includes some new matrices as well. © 2006 Elsevier B.V. All rights reserved.
متن کامل